A Coordinate-Free Condition Number for Convex Programming

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Coordinate-Free Condition Number for Convex Programming

We introduce and analyze a natural geometric version of Renegar’s condition number R, which we call Grassmann condition number, for the homogeneous convex feasibility problem associated with a regular cone C ⊆ R. Let Grn,m denote the Grassmann manifold of m-dimensional linear subspaces of R with the Riemannian distance metric dg. The set of ill-posed instances Σm ⊂ Grn,m consists of the linear ...

متن کامل

Minimizing Condition Number via Convex Programming

In this paper we consider minimizing the spectral condition number of a positive semidefinite matrix over a nonempty closed convex set Ω. We show that it can be solved as a convex programming problem, and moreover, the optimal value of the latter problem is achievable. As a consequence, when Ω is positive semidefinite representable, it can be cast into a semidefinite programming problem. We the...

متن کامل

Robust smoothed analysis of a condition number for linear programming

We perform a smoothed analysis of the GCC-condition number C (A) of the linear programming feasibility problem ∃x ∈ R Ax < 0. Suppose that Ā is any matrix with rows ai of euclidean norm 1 and, independently for all i, let ai be a random perturbation of ai following the uniform distribution in the spherical disk in S of angular radius arcsinσ and centered at ai. We prove that E(ln C (A)) = O(mn/...

متن کامل

Uniform Smoothed Analysis of a Condition Number for Linear Programming

Bürgisser, Cucker, and Lotz [arxiv:math.NA/0610270] proved a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Applications to linear and polynomial equation solving were given. We show that a suitable modification of the general theorem in that paper, adapted to a spherical convex setting, allows to analyze condition numbers of...

متن کامل

Condition number and eccentricity of a closed convex cone

We discuss some extremality issues concerning the circumradius, the inradius, and the condition number of a closed convex cone in Rn. The condition number refers to the ratio between the circumradius and the inradius. We also study the eccentricity of a closed convex cone, which is a coefficient that measures to which extent the circumcenter differs from the incenter.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Optimization

سال: 2012

ISSN: 1052-6234,1095-7189

DOI: 10.1137/110835177